A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths
نویسندگان
چکیده
For two vertices s and t in a graph G = (V,E), the next-to-shortest path is an st-path which length is minimum amongst all st-paths strictly longer than the shortest path length. In this paper we show that, when the graph is undirected and all edge lengths are nonnegative, the problem can be solved in linear time if the distances from s and t to all other vertices are given.
منابع مشابه
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
Given an edge-weighted undirected graph and two vertices s and t, the next-to-shortest path problem is to find an st-path whose length is minimum among all st-paths of lengths strictly larger than the shortest path length. The problem is shown to be polynomially solvable if all edge weights are positive, while the complexity status for the nonnegative weight case was open. In this paper we show...
متن کاملA Polynomial-Time Algorithm for the Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
Given an edge-weighted undirected graph and two vertices s and t, the next-to-shortest path problem is to find an st-path whose length is minimum among all st-paths of lengths strictly larger than the shortest path length. The problem is shown to be polynomially solvable if all edge weights are positive, while the complexity status for the nonnegative weight case was open. In this paper we show...
متن کاملA Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
We give an algorithm requiring O(c1/ǫ 2 n) time to find an ǫ-optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgelengths. For the case of all lengths equal to 1, the time required is O(c1/ǫn).
متن کاملA Shortest Path Algorithm for Real-Weighted Undirected Graphs
We present a new scheme for computing shortest paths on real-weighted undirected graphs in the fundamental comparison-addition model. In an efficient preprocessing phase our algorithm creates a linear-size structure that facilitates single-source shortest path computations in O(m logα) time, where α = α(m,n) is the very slowly growing inverse-Ackermann function, m the number of edges, and n the...
متن کاملI/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
We show how to compute single-source shortest paths in undirected graphs with non-negative edge lengths in O( p nm/B logn+ MST (n, m)) I/Os, where n is the number of vertices, m is the number of edges, B is the disk block size, and MST (n, m) is the I/O-cost of computing a minimum spanning tree. For sparse graphs, the new algorithm performs O((n/ √ B) logn) I/Os. This result removes our previou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1203.5235 شماره
صفحات -
تاریخ انتشار 2012